Specifying Stateful Asynchronous Properties for Distributed Programs

نویسندگان

  • Tzu-Chun Chen
  • Kohei Honda
چکیده

Having stateful specifications to track the states of processes, such as the balance of a customer for online shopping or the booking number of a transaction, is needed to verify real-life interacting systems. For safety assurance of distributed IT infrastructures, specifications need to capture states in the presence of asynchronous interactions. We demonstrate that not all specifications are suitable for asynchronous observations because they implicitly rely on an orderpreservation assumption. To establish a theory of asynchronous specifications, we use the interplay between synchronous and asynchronous semantics, through which we characterise the class of specifications suitable for verifications through asynchronous interactions. The resulting theory offers a general semantic setting as well as concrete methods to analyse and determine semantic well-formedness (healthiness) of specifications with respect to asynchronous observations, for both static and dynamic verifications. In particular, our theory offers a key criterion for suitability of specifications for distributed dynamic verifications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D: Datalog in Time and Space

Recent research has explored using Datalog-based languages to express a distributed system as a set of logical invariants [3, 28]. Two properties of distributed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped, or reordered by the unreliable network links they mus...

متن کامل

Topological Self-Stabilization with Name-Passing Process Calculi

Topological self-stabilization is the ability of a distributed system to have its nodes themselves establish a meaningful overlay network. Independent from the initial network topology, it converges to the desired topology via forwarding, inserting, and deleting links to neighboring nodes. We adapt a linearization algorithm, originally designed for a shared memory model, to asynchronous message...

متن کامل

On the Veriication of Open Distributed Systems 1

A logic and proof system is introduced for specifying and proving properties of open distributed systems. Key problems that are addressed include the veriication of process networks with a changing interconnection structure, and where new processes can be continuously spawned. To demonstrate the results in a realistic setting we consider a core fragment of the Erlang programming language. Rough...

متن کامل

On Decentralized Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems

We present two classes of distributed algorithms called DRBA and DOBA, for decentralized, proactive resource allocation in asynchronous real-time distributed systems. The objective of the algorithms is to maximize aggregate application benefit and deadlinesatisfied ratio for an user-specified future time interval. Since determining the optimal allocation is computationally intractable, the algo...

متن کامل

A Theory of Distributed Systems

The theory θ presented here is the smallest theory in the temporal logic TLB [10] that all distributed systems, according to our definition of a distributed system, must satisfy. θ is an instance of the classical modal logic S4.2. The central theorems of θ are stated here without proof. Proofs will appear in [10]. Logics like TLA [14] and TLRCS [18] are used for specifying computer programs and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012